Maxmin fair scheduling in wireless networks
نویسندگان
چکیده
We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints. We propose a fair scheduling which assigns dynamic weights to the flows such that the weights depend on the congestion in the neighborhood and schedule the flows which constitute a maximum weighted matching. It is possible to analytically prove that this policy attains both short term and long term fairness. We consider more generalized fairness notions, and suggest mechanisms to attain these objectives.
منابع مشابه
A distributed scheduling method for maxmin fair bandwidth allocation in wireless ad hoc networks
We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes. The primary objective is to derive a distributed coordination method for schedule construction and modification for any wireless ad-hoc network that operates under a schedule where transmissions at each slot are explicitl...
متن کاملFair Matching Algorithm: Fixed-Length Frame Scheduling in All-Photonic Networks
Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but they introduce network scheduling challenges. In this paper we focus on scheduling fixed-length frames in all-photonic star-topology networks. We describe the Fair Matching (FMA) and Equal Share (ESA) algorithms, novel scheduling procedur...
متن کاملDISTRIBUTED SOLUTIONS FOR RATE CONTROL AND MAXIMUM LIFETIME IN WIRELESS NETWORKS By LIANG ZHANG A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY
of dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy DISTRIBUTED SOLUTIONS FOR RATE CONTROL AND MAXIMUM LIFETIME IN WIRELESS NETWORKS By Liang Zhang August 2009 Chair: Shigang Chen Major: Computer Engineering This study focuses on end-to-end flow rate fairness and lifetime fairness in wire...
متن کاملEnd-to-end maxmin fairness in multihop wireless networks: Theory and protocol
To promote commercial deployment of multihop wireless networks, the research/industry communities must develop new theories and protocols for flexible traffic engineering in these networks in order to support diverse user applications. This paper studies an important traffic engineering problem – how to support fair bandwidth allocation among all end-to-end flows in a multihop wireless network ...
متن کامل